Computation of Elementary Siphons in Petri Nets For Deadlock Control

When designing liveness-enforcing Petri net supervisors, unlike other techniques, Li et al. added control places and arcs to a plant net model for its elementary siphons only, greatly reducing the structural complexity of the controlled system. Their method, however, suffers from the expensive computation of siphons. We propose a new T-characteristic vector z to compute strict minimal siphons (SMS) for SPR (systems of simple sequential processes with resources) in an algebraic fashion. For a special subclass of SPR, called SPR (simple SPR), we discover that elementary siphons can be constructed from elementary circuits where all places are resources. Thus, the set of elementary siphons can be computed without the knowledge of all SMS. We also propose to construct characteristic T-vectors h by building a graph to find dependent siphons without their computations.